Skew Diagrams and Ordered Trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of skew Ferrers diagrams

Delest, M. In this paper, we show that the generating function for skew Ferrers diagrams according to their width and area is the quotient of new basic Bessel functions. Nous montrons dans cet article que la fonction g&ntratrice des diagrammes de Ferrers gauches selon les paramktres ptrimttre et aire s'exprime en fonction du quotient des q analogues de deux fonctions de Bessel.

متن کامل

Skew Jensen-Bregman Voronoi Diagrams

A Jensen-Bregman divergence is a distortion measure defined by a Jensen convexity gap induced by a strictly convex functional generator. Jensen-Bregman divergences unify the squared Euclidean and Mahalanobis distances with the celebrated information-theoretic JensenShannon divergence, and can further be skewed to include Bregman divergences in limit cases. We study the geometric properties and ...

متن کامل

Double-Dimer Pairings and Skew Young Diagrams

We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are “vertically decreasing”. We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar bipartite graph G with special vertices, called nodes, on the outer face, the doubledimer model is formed by the superposition of a uniformly random dimer c...

متن کامل

Learning Ordered Binary Decision Diagrams

This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that nds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output, unless P=NP. If learning has to occur ...

متن کامل

Cohomology of Ordered Bratteli Diagrams

Given a simple ordered Bratteli diagram, B, with multiple maximal paths and minimal paths, and the Natural Extension system (X; T) generated by this diagram, there is a compact topological graph G which gives the following exact sequence:

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2001

ISSN: 0196-8858

DOI: 10.1006/aama.2001.0755